Can Cut-Generating Functions Be Good and Efficient?
نویسندگان
چکیده
منابع مشابه
Cut-Generating Functions
In optimization problems such as integer programs or their relaxations, one encounters feasible regions of the form {x ∈ R+ : Rx ∈ S} where R is a general real matrix and S ⊂ R is a specific closed set with 0 / ∈ S. For example, in a relaxation of integer programs introduced in [ALWW2007], S is of the form Z − b where b 6∈ Z . One would like to generate valid inequalities that cut off the infea...
متن کاملSufficiency of cut-generating functions
This note settles an open problem about cut-generating functions, a concept that has its origin in the work of Gomory and Johnson from the 1970’s and has received renewed attention in recent years.
متن کاملCut-Generating Functions and S-Free Sets
We consider the separation problem for sets X that are inverse images of a given set S by a linear mapping. Classical examples occur in integer programming, complementarity problems and other optimization problems. One would like to generate valid inequalities that cut off some point not lying in X , without reference to the linear mapping. Formulas for such inequalities can be obtained through...
متن کاملA geometric approach to cut-generating functions
The cutting-plane approach to integer programming was initiated more that 40 years ago: Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau form and Balas introduced intersection cuts for the corner polyhedron. This line of research was left dormant for several decades until relatively recently, when a paper of Andersen, Louveaux, Weismantel and Wolsey gene...
متن کاملCut-Generating Functions for Integer Variables
For an integer linear program, Gomory’s corner relaxation is obtained by ignoring the nonnegativity of the basic variables in a tableau formulation. In this paper, we do not relax these nonnegativity constraints. We generalize a classical result of Gomory and Johnson characterizing minimal cut-generating functions in terms of subadditivity, symmetry, and periodicity. Our result is based on a ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2019
ISSN: 1052-6234,1095-7189
DOI: 10.1137/18m117354x